# class bar:
#     def __init__(self):
#         self.data = []

#     def empty(self):
#         return len(self.data) == 0
    
#     def push(self, e):
#         self.data.append(e)

#     def pop(self):
#         assert self.empty()
#         return self.data.pop()
    
#     def get_top(self):
#         assert self.empty()
#         return self.data[-1]

#     def dis(self):
#         for i in range(len(self.data)):
#             print(self.data[i])

# def solve_hanoi(X, Y, Z, n):
#     for e in n:
#         X.push(e)
#     X.dis()



# if __name__ == "__main__":
#     X = bar()
#     Y = bar()
#     Z = bar()
#     n = [1, 2, 3, 4]
#     solve_hanoi(X, Y, Z, n)
    